The must preorder revisited – an algebraic theory for web services contracts –
نویسندگان
چکیده
We define a language for Web services contracts as a parallelfree fragment of ccs and we study a natural notion of compliance between clients and services in terms of their corresponding contracts. The induced contract preorder turns out to be valuable in searching and querying registries of Web services, it shows interesting connections with the must preorder, and it exhibits good precongruence properties when choreographies of Web services are considered. Our contract language may be used as a foundation of Web services technologies, such as wsdl and wscl.
منابع مشابه
Choreographies and Behavioural Contracts on the Way to Dynamic Updates
We survey our work on choreographies and behavioural contracts in multiparty interactions. In particular theories of behavioural contracts are presented which enable reasoning about correct service composition (contract compliance) and service substitutability (contract refinement preorder) under different assumptions concerning service communication: synchronous address or name based communica...
متن کاملMultiparty Testing Preorders
Variants of the must testing approach have been successfully applied in Service Oriented Computing for analysing the compliance between (contracts exposed by) clients and servers or, more generally, between two peers. It has however been argued that multiparty scenarios call for more permissive notions of compliance because partners usually do not have full coordination capabilities. We propose...
متن کاملAn algebraic theory of componentised interaction
This thesis provides a specification theory with strong algebraic and compositionality properties, allowing for the systematic construction of new components out of existing ones, while ensuring that given properties continue to hold at each stage of system development. The theory shares similarities with the interface automata of de Alfaro and Henzinger, but is linear-time in the style of Dill...
متن کاملFair Testing Revisited: A Process-Algebraic Characterisation of Conflicts
This paper studies conflicts from a process-algebraic point of view and shows how they are related to the testing theory of fair testing. Conflicts have been introduced in the context of discrete event systems, where two concurrent systems are said to be in conflict if they can get trapped in a situation where they are waiting or running endlessly, forever unable to complete their common task. ...
متن کاملCompetition, complementarity and service level guarantee in Web services
Network and processing overhead associated with web services is a significant challenge to its performance. As a result, web service providers often announce a service level agreement. This ensures that consumers, who pay for the service, can get the service at a given quality level. In this paper, we study the competition between two providers offering functionally the same web services, whe...
متن کامل